Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems
نویسندگان
چکیده
We give lower bounds on the complexity of word problem for a large class non-solvable infinite groups that we call strongly efficiently groups. This includes free groups, Grigorchuk’s group, and Thompson’s prove these have an NC 1 -hard some them (including group groups) compressed (which is equivalent to circuit evaluation problem) PSPACE-complete.
منابع مشابه
Word Problems on Compressed Words
Motivation In general, computational problems become harder, when inputs are represented in a compressed form. Motivation In general, computational problems become harder, when inputs are represented in a compressed form. • Develop efficient algorithms on compressed data (strings, trees, pictures) that operate directly on compressed data without decompressing them first. • Prove lower bounds on...
متن کاملWord Problems and Membership Problems on Compressed Words
We consider a compressed form of the word problem for finitely presented monoids, where the input consists of two compressed representations of words over the generators of a monoid M, and we ask whether these two words represent the same monoid element of M. Words are compressed using straight-line programs, i.e., context-free grammars that generate exactly one word. For several classes of fin...
متن کاملCharacterizing Word Problems of Groups
The word problem of a finitely generated group is a fundamental notion in group theory; it can be defined as the set of all the words in the generators of the group that represent the identity element of the group. This definition allows us to consider a word problem as a formal language and a rich topic of research concerns the connection between the complexity of this language and the algebra...
متن کاملCompressed Word Problems for Inverse Monoids
The compressed word problem for a finitely generated monoid M asks whether two given compressed words over the generators of M represent the same element of M . For string compression, straight-line programs, i.e., contextfree grammars that generate a single string, are used in this paper. It is shown that the compressed word problem for a free inverse monoid of finite rank at least two is comp...
متن کاملSpace Complexity and Word Problems of Groups
In this section we will give an overview of the paper; precise definitions of the terms used here will be found in Sections 2, 3 and 4. Our starting point is that there are several intriguing links between group theory and formal language theory. One of the many interesting such connections is the consideration of which groups G have a word problem lying in a particular class F of formal langua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2022
ISSN: ['1942-3454', '1942-3462']
DOI: https://doi.org/10.1145/3569708